本文报告了Chalearn的Autodl挑战系列的结果和后攻击分析，这有助于对自动学习（DL）进行分类，以便在各种环境中引入的深度学习（DL），但缺乏公平的比较。格式化所有输入数据模型（时间序列，图像，视频，文本，表格）作为张量，所有任务都是多标签分类问题。代码提交已在隐藏的任务上执行，具有限制时间和计算资源，推动快速获取结果的解决方案。在此设置中，DL方法占主导地位，但流行的神经结构搜索（NAS）是不切实际的。解决方案依赖于微调预培训的网络，架构匹配数据模块。挑战后测试没有透露超出强加时间限制的改进。虽然没有组件尤其原始或新颖，但是一个高级模块化组织出现了“Meta-Learner”，“数据摄入”，“模型选择器”，“模型/学习者”和“评估员”。这种模块化使得消融研究，揭示了（离坡）元学习，合奏和高效数据管理的重要性。异构模块组合的实验进一步证实了获胜解决方案的（本地）最优性。我们的挑战队遗产包括一个持久的基准（http://utodl.chalearn.org），获胜者的开放源代码，以及免费的“autodl自助服务”。

从视频和动态数据自动活动识别是一种重要的机器学习问题，其应用范围从机器人到智能健康。大多数现有的作品集中在确定粗动作，如跑步，登山，或切割植物，其具有相对长的持续时间。这对于那些需要细微动作中的高时间分辨率识别应用的一个重要限制。例如，在中风恢复，定量康复剂量需要区分具有亚秒持续时间的运动。我们的目标是弥合这一差距。为此，我们引入了一个大规模，多数据集，StrokeRehab，为包括标记高时间分辨率微妙的短期操作的新动作识别基准。这些短期的行为被称为功能性原语和由河段，运输，重新定位，稳定作用，和空转的。所述数据集由高品质的惯性测量单元的传感器和执行的日常生活像馈送，刷牙等的活动41中风影响的病人的视频数据的，我们表明，基于分割产生嘈杂状态的最先进的现有机型预测时，对这些数据，这往往会导致行动超量。为了解决这个问题，我们提出了高分辨率的活动识别，通过语音识别技术的启发，它是基于一个序列到序列模型，直接预测的动作序列的新方法。这种方法优于国家的最先进的电流在StrokeRehab数据集的方法，以及对标准的基准数据集50Salads，早餐，和拼图。

在典型的优化问题中，任务是选择成本最低或最高价值的多个选项之一。实际上，这些成本/价值数量通常是通过诸如嘈杂的测量或机器学习等过程来实现的，具有可量化的噪声分布。要考虑到这些噪声分布，一种方法是假设值的先验，使用它来构建后部，然后应用标准随机优化来选择解决方案。但是，在许多实际应用中，此类先前的分布可能没有可用。在本文中，我们使用遗憾最小化模型研究了这种情况。在我们的模型中，任务是在$ n $值中选择最高的一个。这些值是未知的，并由对手选择，但是可以通过嘈杂的通道观察到，在噪声通道中，从已知的分布开始添加噪声。目的是最大程度地减少我们选择的遗憾，该遗憾定义为最高值选择的最高值和所选值之间的预期差异。我们表明，挑选最高观测值的na \“我的算法也对最佳级别的遗憾也后悔，即使$ n = 2 $，并且噪声是公正的。对于任何$ n $的最佳遗憾。我们的算法在概念上是简单的，计算上的效率，并且仅需要对噪声分布的最小知识。

手工和小规模的黄金开采（ASGM）是许多家庭的重要收入来源，但它可以产生巨大的社会和环境影响，尤其是在发展中国家的雨林中。Sentinel-2卫星收集了多光谱图像，可用于检测水位和质量的变化，这表明采矿地点位置。这项工作着重于对秘鲁亚马逊雨林中ASGM活动的认可。我们根据支持向量机（SVM）测试了几个半监督分类器，以检测Madre de Dios地区从2019年到2021年的水体变化，这是ASGM活动的全球热点之一。实验表明，基于SVM的模型可以实现RGB的合理性能（使用Cohen的$ \ kappa $ 0.49）和6通道图像（使用Cohen的$ \ kappa $ 0.71），具有非常有限的注释。还分析了合并实验室色彩空间的功效。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

Dataset distillation has emerged as a prominent technique to improve data efficiency when training machine learning models. It encapsulates the knowledge from a large dataset into a smaller synthetic dataset. A model trained on this smaller distilled dataset can attain comparable performance to a model trained on the original training dataset. However, the existing dataset distillation techniques mainly aim at achieving the best trade-off between resource usage efficiency and model utility. The security risks stemming from them have not been explored. This study performs the first backdoor attack against the models trained on the data distilled by dataset distillation models in the image domain. Concretely, we inject triggers into the synthetic data during the distillation procedure rather than during the model training stage, where all previous attacks are performed. We propose two types of backdoor attacks, namely NAIVEATTACK and DOORPING. NAIVEATTACK simply adds triggers to the raw data at the initial distillation phase, while DOORPING iteratively updates the triggers during the entire distillation procedure. We conduct extensive evaluations on multiple datasets, architectures, and dataset distillation techniques. Empirical evaluation shows that NAIVEATTACK achieves decent attack success rate (ASR) scores in some cases, while DOORPING reaches higher ASR scores (close to 1.0) in all cases. Furthermore, we conduct a comprehensive ablation study to analyze the factors that may affect the attack performance. Finally, we evaluate multiple defense mechanisms against our backdoor attacks and show that our attacks can practically circumvent these defense mechanisms.

Few Shot Instance Segmentation (FSIS) requires models to detect and segment novel classes with limited several support examples. In this work, we explore a simple yet unified solution for FSIS as well as its incremental variants, and introduce a new framework named Reference Twice (RefT) to fully explore the relationship between support/query features based on a Transformer-like framework. Our key insights are two folds: Firstly, with the aid of support masks, we can generate dynamic class centers more appropriately to re-weight query features. Secondly, we find that support object queries have already encoded key factors after base training. In this way, the query features can be enhanced twice from two aspects, i.e., feature-level and instance-level. In particular, we firstly design a mask-based dynamic weighting module to enhance support features and then propose to link object queries for better calibration via cross-attention. After the above steps, the novel classes can be improved significantly over our strong baseline. Additionally, our new framework can be easily extended to incremental FSIS with minor modification. When benchmarking results on the COCO dataset for FSIS, gFSIS, and iFSIS settings, our method achieves a competitive performance compared to existing approaches across different shots, e.g., we boost nAP by noticeable +8.2/+9.4 over the current state-of-the-art FSIS method for 10/30-shot. We further demonstrate the superiority of our approach on Few Shot Object Detection. Code and model will be available.

This paper focuses on designing efficient models with low parameters and FLOPs for dense predictions. Even though CNN-based lightweight methods have achieved stunning results after years of research, trading-off model accuracy and constrained resources still need further improvements. This work rethinks the essential unity of efficient Inverted Residual Block in MobileNetv2 and effective Transformer in ViT, inductively abstracting a general concept of Meta-Mobile Block, and we argue that the specific instantiation is very important to model performance though sharing the same framework. Motivated by this phenomenon, we deduce a simple yet efficient modern \textbf{I}nverted \textbf{R}esidual \textbf{M}obile \textbf{B}lock (iRMB) for mobile applications, which absorbs CNN-like efficiency to model short-distance dependency and Transformer-like dynamic modeling capability to learn long-distance interactions. Furthermore, we design a ResNet-like 4-phase \textbf{E}fficient \textbf{MO}del (EMO) based only on a series of iRMBs for dense applications. Massive experiments on ImageNet-1K, COCO2017, and ADE20K benchmarks demonstrate the superiority of our EMO over state-of-the-art methods, \eg, our EMO-1M/2M/5M achieve 71.5, 75.1, and 78.4 Top-1 that surpass \textbf{SoTA} CNN-/Transformer-based models, while trading-off the model accuracy and efficiency well.

Benefiting from the intrinsic supervision information exploitation capability, contrastive learning has achieved promising performance in the field of deep graph clustering recently. However, we observe that two drawbacks of the positive and negative sample construction mechanisms limit the performance of existing algorithms from further improvement. 1) The quality of positive samples heavily depends on the carefully designed data augmentations, while inappropriate data augmentations would easily lead to the semantic drift and indiscriminative positive samples. 2) The constructed negative samples are not reliable for ignoring important clustering information. To solve these problems, we propose a Cluster-guided Contrastive deep Graph Clustering network (CCGC) by mining the intrinsic supervision information in the high-confidence clustering results. Specifically, instead of conducting complex node or edge perturbation, we construct two views of the graph by designing special Siamese encoders whose weights are not shared between the sibling sub-networks. Then, guided by the high-confidence clustering information, we carefully select and construct the positive samples from the same high-confidence cluster in two views. Moreover, to construct semantic meaningful negative sample pairs, we regard the centers of different high-confidence clusters as negative samples, thus improving the discriminative capability and reliability of the constructed sample pairs. Lastly, we design an objective function to pull close the samples from the same cluster while pushing away those from other clusters by maximizing and minimizing the cross-view cosine similarity between positive and negative samples. Extensive experimental results on six datasets demonstrate the effectiveness of CCGC compared with the existing state-of-the-art algorithms.

As one of the prevalent methods to achieve automation systems, Imitation Learning (IL) presents a promising performance in a wide range of domains. However, despite the considerable improvement in policy performance, the corresponding research on the explainability of IL models is still limited. Inspired by the recent approaches in explainable artificial intelligence methods, we proposed a model-agnostic explaining framework for IL models called R2RISE. R2RISE aims to explain the overall policy performance with respect to the frames in demonstrations. It iteratively retrains the black-box IL model from the randomized masked demonstrations and uses the conventional evaluation outcome environment returns as the coefficient to build an importance map. We also conducted experiments to investigate three major questions concerning frames' importance equality, the effectiveness of the importance map, and connections between importance maps from different IL models. The result shows that R2RISE successfully distinguishes important frames from the demonstrations.